#include<bits/stdc++.h>
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x);write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=2e5+5,K=55,mod=998244353;
inline int Mod(int x){return x>=mod?x-mod:x;}
inline int poww(int x,int y){
	int sum=1;
	while(y){
		if(y&1)sum=1ll*sum*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return sum;
}
int n,k;
int fa[N],siz[N];
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
inline void merge(int x,int y){
	int X=find(x),Y=find(y);
	fa[X]=Y,siz[Y]+=siz[X];
	return;	
}
vector<int>to[N],T[N];
void Init(){
	for(int l=1;l<=n;l++){
		for(int i=1;i<=n;i++)fa[i]=i,siz[i]=1;
		for(int r=l;r<=n;r++){
			for(auto y:to[r])if(y>=l)
				merge(y,r);
			if(siz[r]==r-l+1)T[r].push_back(l);
		}
	}
}
int f[N][K],maxn[N];
void sol(){
	f[0][0]=1;
	for(int i=1;i<=n;i++){
		for(auto j:T[i]){
			for(int l=1;l<=min(i,min(k,maxn[j-1]+1));l++){
				if(f[j-1][l-1])
					f[i][l]=Mod(f[i][l]+f[j-1][l-1]),
					maxn[i]=max(maxn[i],l);
			}
		}
	}
}
int fac[N],inv[N];
void SUB1(){
	for(int i=fac[0]=1;i<=n;i++)fac[i]=1ll*i*fac[i-1]%mod;
	inv[n]=poww(fac[n],mod-2);for(int i=n;i;i--)inv[i-1]=1ll*i*inv[i]%mod;
	for(int i=1;i<=k;i++)write(1ll*fac[n-1]*inv[i-1]%mod*inv[n-i]%mod),putch('\n');
}
signed main(){
	freopen("soft.in","r",stdin);
	freopen("soft.out","w",stdout);
	read(n,k);
	int ops=1;
	for(int i=1;i<n;i++){
		int x,y;
		read(x,y);
		if(x<y)swap(x,y);
		if(x-y!=1)ops=0;
		to[x].push_back(y);
	}
	if(ops){
		SUB1();
		flush();
		return 0;	
	}
	Init();
	sol();
	for(int i=1;i<=k;i++)write(f[n][i]),putch('\n');
	flush();
	return 0;
}

